A quick construction of a retraction of all retractions for stable bifinitesAMADIO, R. M.Information and computation (Print). 1995, Vol 116, Num 2, pp 272-274, issn 0890-5401Article

Subtyping recursive typesAMADIO, R. M; CARDELLI, L.ACM transactions on programming languages and systems. 1993, Vol 15, Num 4, pp 575-631, issn 0164-0925Article

Analysis of a guard condition in type theoryAMADIO, R. M; COUPET-GRIMAL, S.Lecture notes in computer science. 1998, pp 48-62, issn 0302-9743, isbn 3-540-64300-1Conference Paper

On bisimulations for the asynchronous π-calculusAMADIO, R. M; CASTELLANI, I; SANGIORGI, D et al.Theoretical computer science. 1998, Vol 195, Num 2, pp 291-324, issn 0304-3975Conference Paper

On the reachability problem in cryptographic protocolsAMADIO, R. M; LUGIEZ, D.Lecture notes in computer science. 2000, pp 380-394, issn 0302-9743, isbn 3-540-67897-2Conference Paper

The receptive distributed π-calculusAMADIO, R. M; BOUDOL, G; LHOUSSAINE, C et al.Lecture notes in computer science. 1999, pp 304-315, issn 0302-9743, isbn 3-540-66836-5Conference Paper

The game of the name in cryptographic tablesAMADIO, R. M; PRASAD, S.Lecture notes in computer science. 1999, pp 15-26, issn 0302-9743, isbn 3-540-66856-XConference Paper

Modelling IP mobilityAMADIO, R. M; PRASAD, S.Lecture notes in computer science. 1998, pp 301-316, issn 0302-9743, isbn 3-540-64896-8Conference Paper